Parameterized complexity

Results: 172



#Item
131Complexity classes / NP-complete problems / Analysis of algorithms / Parameterized complexity / NP-complete / Vertex cover / Time complexity / Travelling salesman problem / Matching / Theoretical computer science / Computational complexity theory / Applied mathematics

WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 04:49:01
132NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph coloring / Bidimensionality / Kernelization / Dominating set / Branch-decomposition / Vertex cover / Theoretical computer science / Graph theory / Computational complexity theory

Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-09-04 06:03:49
133Parameterized complexity / Analysis of algorithms / Time complexity / NP-complete problems / Algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:11:27
134Graph coloring / NP-complete problems / Analysis of algorithms / Parameterized complexity / List coloring / Graph / Travelling salesman problem / Kernelization / Edge coloring / Graph theory / Theoretical computer science / Mathematics

Incremental List Coloring of Graphs, Parameterized by Conservation2 Sepp Hartung and Rolf Niedermeier TU Berlin Institut f¨ ur Softwaretechnik und Theoretische Informatik

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2013-02-01 23:13:02
135Network analysis / Parameterized complexity / K-means clustering / Complexity / Consensus clustering / Cluster analysis / Statistics / Computational statistics / Hierarchical clustering

Parameterized Complexity in Practice Luke Mathieson Parameterized Complexity in Practice

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:11:24
136NP-complete problems / Analysis of algorithms / Complexity classes / Parameterized complexity / Kernelization / Bidimensionality / Feedback vertex set / Dominating set / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics

Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter.

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:19:59
137NP-complete problems / Analysis of algorithms / Parameterized complexity / Graph operations / Graph coloring / Bidimensionality / Kernelization / Clique / Dominating set / Theoretical computer science / Graph theory / Computational complexity theory

Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 04:47:38
138Algorithm / Mathematical logic / Color-coding / SL / Graph coloring / Analysis of algorithms / Theoretical computer science / Mathematics / Applied mathematics

Algebraization in parameterized algorithms and complexity and complexity Yiannis Koutis University of Puerto Rico,Rio Piedras

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2013-02-01 22:18:40
139Computer science / Computing / Computational complexity theory / Parameterized complexity / B-tree

Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees Sylvain Guillemot, Fran¸cois Nicolas LIRMM, Montpellier France

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2006-07-28 09:21:00
140Intersection graph / Clique / Representation / Path decomposition / Trapezoid graph / Graph theory / Interval graph / Circle graph

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs Minghui Jiang Utah State University CPM

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2010-08-20 17:45:36
UPDATE